From X to π Representing the Classical Sequent
نویسندگان
چکیده
We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK have a representation in π.
منابع مشابه
Representing the Classical Sequent Calculus in the π-calculus
We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK ...
متن کاملFrom X to π Representing the Classical Sequent Calculus in π - calculus
We study the π-calculus, where the family of names is enriched with pairing, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that reduction and type assignment are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK have an encoding ...
متن کاملFrom X to π Representing the Classical Sequent Calculus in the π - calculus
We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK ...
متن کاملFrom X to π Representing the Classical Sequent Calculus in the π - calculus Extended
We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK ...
متن کاملFrom X to Pi; Representing the Classical Sequent Calculus in the Pi-calculus
We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK ...
متن کامل